PSPACE Is Provable By Two Provers In One Round
نویسندگان
چکیده
We show that every language in PSPACE, or equivalently every language accepted by an unbounded round interactive proof system, has a 1-round, 2-prover interactive proof system with exponentially small error probability. To obtain this result, we prove the correctness of a simple but powerful method for parallelizing 2-prover interactive proof systems to reduce their error. 3
منابع مشابه
Polynomial-Space Approximation of No-Signaling Provers
In two-prover one-round interactive proof systems, no-signaling provers are those who are allowed to use arbitrary strategies, not limited to local operations, as long as their strategies cannot be used for communication between them. Study of multi-prover interactive proof systems with no-signaling provers is motivated by study of those with provers sharing quantum states. The relation between...
متن کاملOn Helping and Interactive Proof Systems
We investigate the complexity of honest provers in interactive proof systems This corresponds precisely to the complexity of oracles helping the computation of robust probabilistic oracle machines We obtain upper bounds for languages in FewEXP and for sparse sets in NP Further interactive protocols with provers that are reducible to sets of low information content are considered Speci cally if ...
متن کاملInteractive proofs with competing teams of no-signaling provers
This paper studies a generalization of multi-prover interactive proofs in which a verifier interacts with two competing teams of provers: one team attempts to convince the verifier to accept while the other attempts to convince the verifier to reject. Each team consists of two provers who jointly implement a no-signaling strategy. No-signaling strategies are a curious class of joint strategy th...
متن کاملDeciding Provability of Linear Logic Formulas
A great deal of insight about a logic can be derived from the study of the diiculty of deciding if a given formula is provable in that logic. Most rst order logics are undecidable and are linear time decidable with no quantiiers and no propositional symbols. However , logics diier greatly in the complexity of deciding propositional formulas. For example, rst-order classical logic is undecidable...
متن کاملOn the Role of Shared Randomness in Two Prover Proof Systems
In this paper we consider which aspects of the two prover model are necessary for their striking language recognition and zero-knowledge capabilities. We approach this question by looking at an alternative, more symmetric model which w e call the double veriier model. We nd that in this model the shared randomness of the veriiers is key to the language recognition power: if the veriiers don't s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1991